منابع مشابه
Communication Efficient Quantum Secret Sharing
Building upon the recent work in communication efficient classical secret sharing schemes of Bitar and El Rouayheb, we study communication efficient quantum secret sharing schemes. In the standard model of quantum secret sharing, typically one is interested in minimal authorized sets for the reconstruction of the secret. In such a setting, reconstruction requires the communication of all the sh...
متن کاملSpace Efficient Secret Sharing
A k-out-of-n secret sharing scheme conventionally encodes a single secret s in n shares such that any k of them can be used to reconstruct the secret (Shamir’s scheme [1]). However, Shamir’s scheme is not space efficient because it leads to a n-fold increase in total storage requirement. Some efforts have been made to create space efficient schemes [5, 6] under certain restrictions, but most ot...
متن کاملEfficient Rational Secret Sharing in Standard Communication Networks
We propose a new methodology for rational secret sharing leading to various instantiations (in both the two-party and multi-party settings) that are simple and efficient in terms of computation, share size, and round complexity. Our protocols do not require physical assumptions or simultaneous channels, and can even be run over asynchronous, point-to-point networks. We also propose new equilibr...
متن کاملCommunication E cient Secret Sharing
A secret sharing scheme is a method to store information securely and reliably. Particularly, in the threshold secret sharing scheme (due to Shamir), a secret is divided into shares, encoded and distributed to parties, such that any large enough collection of parties can decode the secret, and a smaller (then threshold) set of parties cannot collude to deduce any information about the secret. W...
متن کاملExtended Abstract: Space Efficient Secret Sharing
This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n ≥ k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2616144